Briggs' logarithm of $n!$
نویسندگان
چکیده
منابع مشابه
Response to Briggs
association between [chronic PM] air pollution exposure and health [mortality]." In applying these criteria, I have included experimental studies in animals and epi-demiologic studies in humans (6). Rodents exposed to high concentrations of diesel exhaust for life did not show early or increased mortality (6). The available epi-demiologic studies (3-5) showed only weak associations across a nar...
متن کامل32-35 Briggs Feature
ITE JOURNAL / JANUARY 2001 THE NATIONAL DIALOGUE ON Transportation Operations has identified the need for cultural transitions within transportation organizations from traditional project-driven orientations to approaches focused on continuous systems performance and customer service.1 Institutional change, facilitating interjurisdictional cooperation to provide seamless transportation services...
متن کاملComputing a Discrete Logarithm in O(n^3)
This paper presents a means with time complexity of at worst O(n) to compute the discrete logarithm on cyclic finite groups of integers modulo p. The algorithm makes use of reduction of the problem to that of finding the concurrent zeros of two periodic functions in the real numbers. The problem is treated as an analog to a form of analog rotor code computed cipher. The computation of a Discret...
متن کاملThe Discrete Logarithm Modulo a Composite Hides O(n) Bits
In this paper we consider the one-way function f g;N (X) = g X (modN), where N is a Blum integer. We prove that under the commonly assumed intractability of factoring Blum integers, all its bits are individually hard, and the lower as well as upper halves of them are simultaneously hard. As a result, f g;N can be used in eecient pseudo-random bit generators and multi-bit commitment schemes, whe...
متن کاملThe Discrete Logarithm Hides O(log n) Bits
The main result of this paper is that obtaining any information about the $O(log |p|)$ " most significant " bits of $x$, given $g^x(mod p)$, even with a tiny advantage over guessing, is equivalent to computing discrete logarithms $mod p$.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Časopis pro pěstování matematiky a fysiky
سال: 1886
ISSN: 1802-114X
DOI: 10.21136/cpmf.1886.122223